Regularity properties for dominating projective sets
نویسندگان
چکیده
منابع مشابه
Souslin Absoluteness, Uniformization and Regularity Properties of Projective Sets
We show that Souslin Absoluteness and Projective Regularity holds ii Souslin Uniformization does. As a result, Souslin Absoluteness plus 1 n Projective Regularity implies 1 n+1 Projective Regularity. Another result is that 1 5 Souslin Absoluteness implies 1 4 Projective Regularity, and 1 6 Souslin Absoluteness implies 1 5 Projective Regularity.
متن کاملRegularity Properties of H-convex Sets
We study the firstand second-order regularity properties of the boundary of H-convex sets in the setting of a real vector space endowed with a suitable group structure: our starting point is indeed a step two Carnot group. We prove that, locally, the noncharacteristic part of the boundary has the intrinsic cone property and that it is foliated by intrinsic Lipschitz continous curves that are tw...
متن کاملEfficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Let G = (V,E) be a graph. A vertex dominates itself and all its neighbors, i.e., every vertex v ∈ V dominates its closed neighborhood N [v]. A vertex set D in G is an efficient dominating (e.d.) set for G if for every vertex v ∈ V , there is exactly one d ∈ D dominating v. An edge set M ⊆ E is an efficient edge dominating (e.e.d.) set for G if it is an efficient dominating set in the line graph...
متن کاملConnected Dominating Sets
PROBLEM DEFINITION Consider a graph G = (V,E). A subset C of V is called a dominating set if every vertex is either in C or adjacent to a vertex in C. If, furthermore, the subgraph induced by C is connected, then C is called a connected dominating set. A connected dominating set with a minimum cardinality is called a minimum connected dominating set (MCDS). Computing a MCDS is an NP-hard proble...
متن کاملReconfiguration of Dominating Sets
We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph G is a set S of vertices such that each vertex is either in S or has a neighbour in S. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions s and t such that each pair of consecutive solutions is adjacen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1995
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)00027-z